Best approximation in L∞ via iterative Hilbert space procedures

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Updating Procedures For Iterative Learning Control In Hilbert Space

The research results presented here are extensions of previous work on Iterative Learning Control (ILC) using projection-based update techniques. These updates were mainly developed for Quasi-Newton optimization and also for solving systems of simultaneous equations. Recently, such updates have been used by the authors to estimate the dynamics of a control system which is asked to perform a per...

متن کامل

Viscosity approximation methods for W-mappings in Hilbert space

We suggest a explicit viscosity iterative algorithm for nding a common elementof the set of common xed points for W-mappings which solves somevariational inequality. Also, we prove a strong convergence theorem with somecontrol conditions. Finally, we apply our results to solve the equilibrium problems.Finally, examples and numerical results are also given.

متن کامل

BEST APPROXIMATION SETS IN -n-NORMED SPACE CORRESPONDING TO INTUITIONISTIC FUZZY n-NORMED LINEAR SPACE

The aim of this paper is to present the new and interesting notionof ascending family of  $alpha $−n-norms corresponding to an intuitionistic fuzzy nnormedlinear space. The notion of best aproximation sets in an  $alpha $−n-normedspace corresponding to an intuitionistic fuzzy n-normed linear space is alsodefined and several related results are obtained.

متن کامل

Best Approximation in TVS

In this paper  we give newresults on the best approximation  in the Hausdorff topological vectorspace and  consider relationship  with orthogonality. Also we determined under  what conditions the map $P_{K,f}$ is upper semicontinous.

متن کامل

Clustering via Hilbert space

We discuss novel clustering methods that are based on mapping data points to a Hilbert space by means of a Gaussian kernel. The *rst method, support vector clustering (SVC), searches for the smallest sphere enclosing data images in Hilbert space. The second, quantum clustering (QC), searches for the minima of a potential function de*ned in such a Hilbert space. In SVC, the minimal sphere, when ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Approximation Theory

سال: 1984

ISSN: 0021-9045

DOI: 10.1016/0021-9045(84)90033-9